Robust Shortest Path Problems with Two Uncertain Multiplicative Cost Coefficients Changhyun Kwon Department of Industrial and Systems Engineering University at Buffalo, SUNY, USA

Source URL: www.chkwon.net

• Computational problems
• Edsger W. Dijkstra
• Network theory
• Shortest path problem
• Optimization problem

Selfish routing with oblivious users George Karakostas1? , Taeyon Kim1?? , Anastasios Viglas2 , and Hao Xia1? ? ? 1 2

Source URL: www.cas.mcmaster.ca

• Mathematics
• Computational complexity theory
• Graph theory
• Game theory
• Price of anarchy
• Net
• Flow network
• NC
• Shortest path problem
• Closed and exact differential forms

Is Holism A Problem For Inductive Inference? A Computational Analysis Maxwell A. Bertolero () Thomas L. Griffiths (tom ) Department of Psychology & Helen Wills Neuroscience Ins

Source URL: cocosci.berkeley.edu

• Network theory
• Graph theory
• Networks
• Statistical models
• Algebraic graph theory
• Community structure
• Modularity
• Connectivity
• Bayesian network
• Graphical model
• Graph
• Clique

RTGBeing Stubborn: Developing Optimal Solution Strategies for a Scheduling Problem Despite its NP-Hardness Dr. Oliver Sinnen Department of Electrical and Computer Engineering

Source URL: grk1855.tu-dortmund.de

• Computational complexity theory
• Theory of computation
• Combinatorial optimization
• Complexity classes
• Operations research
• Integer programming
• Heuristic
• Branch and bound
• NP
• Optimization problem
• Pruning
• Reduction

1st Problem Set for the MDS Block Course on High-Dimensional Computational Geometry Helmut Alt, Wolfgang Mulzer Summer 2013

Source URL: www.inf.fu-berlin.de

JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek

Source URL: jmlr.org

• Graph theory
• Computational complexity theory
• Mathematics
• NP-complete problems
• Dense subgraph
• Independent set
• Planted clique
• Clique
• Dense graph
• Hypergraph
• Graph coloring
• Subgraph isomorphism problem

Going Deeper with Convolutions Christian Szegedy1 , Wei Liu2 , Yangqing Jia1 , Pierre Sermanet1 , Scott Reed3 , Dragomir Anguelov1 , Dumitru Erhan1 , Vincent Vanhoucke1 , Andrew Rabinovich4 1 Google Inc. 2 University of

Source URL: www.cs.unc.edu

• Artificial neural networks
• Computational neuroscience
• Artificial intelligence
• Computer vision
• Convolutional neural network
• Deep learning
• Machine learning
• MNIST database
• Vanishing gradient problem
• Receptive field
• Network architecture
• OSI model

5th Problem Set for the MDS Block Course on High-Dimensional Computational Geometry Helmut Alt, Wolfgang Mulzer Summer 2013

Source URL: www.inf.fu-berlin.de

Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem Alex Biryukov Dmitry Khovratovich

Source URL: www.internetsociety.org

• Computational complexity theory
• Theory of computation
• Complexity classes
• Analysis of algorithms
• Finite fields
• NP
• Spacetime tradeoff
• Algorithm
• Time complexity
• IP
• P
• XTR